Перевод: со всех языков на немецкий

с немецкого на все языки

degree of matching

См. также в других словарях:

  • Matching preclusion — In graph theory, a branch of mathematics, the matching preclusion number of a graph G (denoted mp(G)) is the minimum number of edges whose deletion results in the destruction of a perfect matching or near perfect matching (a matching that covers… …   Wikipedia

  • Matching Person & Technology Model — The Matching Person Technology Model organizes influences on the successful use of a variety of technologies: Assistive Technology, Educational Technology, and those used in the workplace, school, home; for healthcare, for mobility and performing …   Wikipedia

  • matching — Synonyms and related words: Olympic games, Olympics, allegory, analogous, analogy, balancing, bout, chromatic, cold, colorific, coloring, comparable, comparative anatomy, comparative degree, comparative grammar, comparative judgment, comparative… …   Moby Thesaurus

  • Nth Degree (song) — Nth Degree Single by Morningwood from the album Morningwood Released Se …   Wikipedia

  • Confounding — factor redirects here. For other uses, see Confounding factor (disambiguation). In statistics, a confounding variable (also confounding factor, lurking variable, a confound, or confounder) is an extraneous variable in a statistical model that… …   Wikipedia

  • Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …   Wikipedia

  • Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… …   Wikipedia

  • Claw-free graph — A claw In graph theory, an area of mathematics, a claw free graph is a graph that does not have a claw as an induced subgraph. A claw is another name for the complete bipartite graph K1,3 (that is, a star graph with three edges, three leaves, and …   Wikipedia

  • Network controllability — Controlling a simple network. Network Controllability concerns the controllability a network. Controllability describes our ability to guide a dynamical system from any initial state to any desired final state in finite time, with a suitable… …   Wikipedia

  • United States — a republic in the N Western Hemisphere comprising 48 conterminous states, the District of Columbia, and Alaska in North America, and Hawaii in the N Pacific. 267,954,767; conterminous United States, 3,022,387 sq. mi. (7,827,982 sq. km); with… …   Universalium

  • Residency (medicine) — Anesthesia residents being led through training with a patient simulator Residency is a stage of graduate medical training. A resident physician or resident (also called a house officer / senior house officer in the United Kingdom and several… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»